When Does Joint Source-channel Coding Outperform Tandem Coding for Systems with Markovian Memory ?

نویسندگان

  • Yangfan Zhong
  • Fady Alajaji
  • Lorne Campbell
چکیده

TANDEM CODING FOR SYSTEMS WITH MARKOVIAN MEMORY ? Yangfan Zhong, Fady Alajaji and L. Lorne Campbell Department of Mathematics and Statistics Queen’s University, Kingston, ON K7L 3N6, Canada fyangfan, fady, [email protected] ABSTRACT In this work, we explore the merits of joint source-channel coding (JSCC) versus traditional tandem coding, which consists of separately performing and concatenating source and channel coding, from the point of view of the error exponent (or reliability function). For a communication system with a discrete stationary ergodic Markov (SEM) source Q and a discrete channel W with additive SEM noise, we present sufficient conditions under which the JSCC error exponent

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large and Moderate Deviations for Joint Source-Channel Coding of Systems With Markovian Memory

We derive novel upper and lower finite length bounds of the error probability in joint source-channel coding when the source is distributed according to an ergodic Markov process and the channel is a Markovian additive channel or a Markovian conditional additive channel. We show that these bounds are tight in the moderate deviations regime and for a certain interval of rates, also in the large ...

متن کامل

Finite-Length Bounds for Joint Source-Channel Coding with Markovian Source and Additive Channel Noise to Achieve Large and Moderate Deviation Bounds

We derive novel upper and lower finite-length bounds of the error probability in joint source-channel coding when the source obeys the ergodic Markov process and the channel is a Markovian additive channel or a Markovian conditional additive channel. These bounds achieve the tight bounds in the large and moderate deviation regimes. Index Terms Markov chain, joint source-channel coding, finite-l...

متن کامل

When Is Joint Source-Channel Coding Worthwhile: An Information Theoretic Perspective

We study, from an information theoretic perspective, the merits of joint sourcechannel (JSC) coding versus traditional tandem coding, which consists of separately performing and concatenating source and channel coding. Specifically, we provide a systematic comparison of the JSC coding error exponent EJ (Q, W ) with the tandem coding error exponent ET (Q, W ) for communication systems with discr...

متن کامل

Joint and tandem source-channel coding with complexity and delay constraints

Two common source-channel coding strategies, joint and tandem, are compared on the basis of distortion vs. complexity and distortion vs. delay by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Channel-optimized transform coding is the joint source-channel strategy; transform coding plus Reed-Solomon coding is the tandem strate...

متن کامل

An Enhanced Joint Source-Channel Decoder

Tandem coding and decoding has been demonstrated to yield arbitrarily low error rates provided a sufficiently large block length is used. When applied to practical systems that are inherently limited to a finite complexity and therefore to finite block lengths, such a strategy may be largely suboptimal. Indeed, a tandem decoding strategy ignores two types of information: the source memory and t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017